Precise Probabilities for Hash Collision Paths
نویسندگان
چکیده
We describe a generally applicable methodology to determine the probability of given differential (near-)collision paths in MDtype hash collision attacks (cf. [WY,WYiY,Kli2]). For MD5 this program is worked out explicitly. The probabilities of three (near-)collision paths are computed. Experiments confirm these results.
منابع مشابه
Computing Almost Exact Probabilities of Differential Hash Collision Paths by Applying Appropriate Stochastic Methods
Generally speaking, the probability of a differential path determines an upper bound for the expected workload and thus for the true risk potential of a differential attack. In particular, if the expected workload seems to be in a borderline region between practical feasibility and non-feasibility it is desirable to know the path probability as exact as possible. We present a generally applicab...
متن کاملNew Local Collisions for the SHA-2 Hash Family
The starting point for collision attacks on practical hash functions is a local collision. In this paper, we make a systematic study of local collisions for the SHA-2 family. The possible linear approximations of the constituent Boolean functions are considered and certain impossible conditions for such approximations are identified. Based on appropriate approximations, we describe a general me...
متن کاملAn 80Gbps FPGA Implementation of a Universal Hash Function based Message Authentication Code
We developed an architecture optimization technique called divide-and-concatenate and applied it to a cryptographic message authentication code (MAC). This is based on two key observations: (i) The area of a multiplier and associated data path decreases quadratically and their speeds increase gradually as their operand size is reduced. (ii) Two w-bit universal hash function data paths (each wit...
متن کاملOn probabilities of hash value matches
Hash functions are used in authentication and cryptography, as well as for the efficient storage and retrieval of data using hashed keys. Hash functions are susceptible to undesirable collisions. To design or choose an appropriate hash function for an application, it is essential to estimate the probabilities with which these collisions can occur. In this paper we consider two problems: one of ...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کامل